Method MAP Preprocess Search MAP Preprocess Search MAP Preprocess Search Time Time Time Time Time Time
نویسندگان
چکیده
Theorem 2 in the main paper introduces the asymptotic complexity of our proposed randomized bilinear hashing scheme BH-Hash. For self-contained consideration, here we provide the proof, which is basically following the technique previously used in the proof of Theorem 1 in (Gionis et al., 1999). Recall that in Theorem 1 of the main paper, we have shown that the proposed BH-Hash is (r, r(1 + ǫ), p1, p2)-sensitive. Particularly, we show that p1 = 1 2 − 2r π2 and p2 = 1 2 − 2r(1+ǫ) π2 for BH-Hash.
منابع مشابه
A New Hybrid Method for Web Pages Ranking in Search Engines
There are many algorithms for optimizing the search engine results, ranking takes place according to one or more parameters such as; Backward Links, Forward Links, Content, click through rate and etc. The quality and performance of these algorithms depend on the listed parameters. The ranking is one of the most important components of the search engine that represents the degree of the vitality...
متن کاملIdentifying Hierarchies for Fast Optimal Search
For some search problems, the graph is known beforehand and there is time to preprocess the graph to make the search faster. One such example is video games, where one can often preprocess maps before a game is released or while a map is loaded into memory. The data produced by preprocessing should use only a small amount of memory, and, in case they are generated during runtime, preprocessing ...
متن کاملNearest neighbor search
Definition 1.1. Nearest Neighbor Search: Given a set of points {x1, . . . , xn} ∈ R preprocess them into a data structure X of size poly(n, d) in time poly(n, d) such that nearest neighbor queries can be performed in logarithmic time. In other words, given a search point q a radius r and X one can return an xi such the ||q − xi|| ≤ r or nothing if no such point exists. The search for xi should ...
متن کاملPALM: Preprocessed Apriori For Logical Matching Using Map Reduce Algorithm
-With the recent explosive growth of the amount of data content and information on the Internet, it has become increasingly difficult for users to find and maximize the utilization of the information found in the internet. Traditional web search engines often return hundreds or thousands of results for a particular search, which is time consuming .In order to overcome these problems, we have de...
متن کاملTesting Some Improvements of the Fukunaga and Narendra's Fast Nearest Neighbour Search Algorithm in a Spelling Task
Nearest neighbour search is one of the most simple and used technique in Pattern Recognition. One of the most known fast nearest neighbour algorithms was proposed by Fukunaga and Narendra. The algorithm builds a tree in preprocess time that is traversed on search time using some elimination rules to avoid its full exploration. This paper tests two new types of improvements in a real data enviro...
متن کامل